Loop-erased Random Walks, Spanning Trees and Hamiltonian Cycles
نویسنده
چکیده
We establish a formula for the distribution of loop-erased random walks at certain random times. Several classical results on spanning trees, including Wilson’s algorithm, follow easily, as well as a method to construct random Hamiltonian cycles.
منابع مشابه
4 A pr 1 99 9 The Upper Critical Dimension of the Abelian Sandpile Model
The existing estimation of the upper critical dimension of the Abelian Sandpile Model is based on a qualitative consideration of avalanches as self-avoiding branching processes. We find an exact representation of an avalanche as a sequence of spanning sub-trees of two-component spanning trees. Using equivalence between chemical paths on the spanning tree and loop-erased random walks, we reduce ...
متن کاملRandom Walks and Random Spanning Trees
We explore algorithms for generating random spanning trees. We first study an algorithm that was developed independently by David Alduous [1] and Andrei Broder [2]. The algorithm uses a a simple random walk in which edges that correspond to the first visit to vertices are added to the spanning tree. Analysis was inspired by Andrei Broder’s paper. Additionally, we study an algorithm by David Wil...
متن کاملGeneralized loop-erased random walks and approximate reachability
In this paper we extend the loop-erased random walk (LERW) to the directed hypergraph setting. We then generalize Wilson’s algorithm for uniform sampling of spanning trees to directed hypergraphs. In several special cases, this algorithm perfectly samples spanning hypertrees in expected polynomial time. Our main application is to the reachability problem, also known as the directed all-terminal...
متن کاملConformal invariance of planar loop-erased random walks and uniform spanning trees
We prove that the scaling limit of loop-erased random walk in a simply connected domain D $ C is equal to the radial SLE2 path. In particular, the limit exists and is conformally invariant. It follows that the scaling limit of the uniform spanning tree in a Jordan domain exists and is conformally invariant. Assuming that ∂D is a C1 simple closed curve, the same method is applied to show that th...
متن کاملLoop Erased Walks and Uniform Spanning Trees
The uniform spanning tree has had a fruitful history in probability theory. Most notably, it was the study of the scaling limit of the UST that led Oded Schramm [Sch00] to introduce the SLE process, work which has revolutionised the study of two dimensional models in statistical physics. But in addition, the UST relates in an intrinsic fashion with another model, the loop erased random walk (or...
متن کامل